A Graph-Spectral Approach to Correspondence Matching
نویسندگان
چکیده
This paper describes a spectral method for graphmatching. We adopt a graphical models viewpoint in which the graph adjacency matrix is taken to represent the transition probability matrix of a Markov chain. The node-order of the steady state random walk associated with this Markov chain is determined by the co-efficent order of the leading eigenvector of the adjacency matrix. We match nodes in different graphs by aligning their sequence order in the steady-state walk. The method proceeds from the nodes with the largest leading eigenvector co-efficient. We develop a brushfire search method to assign correspondences between nodes using the rank-order of the eigenvector co-efficients in first-order neighbourhoods of the graphs. We demonstrate the utility of the new graph-matching method on both synthetic and real graphs.
منابع مشابه
Fast Brain Matching with Spectral Correspondence
Brain matching is an important problem in neuroimaging studies. Current surface-based methods for cortex matching and atlasing, although quite accurate, can require long computation times. Here we propose an approach based on spectral correspondence, where spectra of graphs derived from the surface model meshes are matched. Cerebral cortex matching problems can thus benefit from the tremendous ...
متن کاملNon-rigid motion behaviour learning : a spectral and graphical approach
In this thesis graph spectral methods and kernel methods are combined together for the tasks of rigid and non-rigid feature correspondence matching and consistent labelling. The thesis is divided into five chapters. In Chapter 1 we give a brief introduction and an outline of the thesis. In Chapter 2 we review the main techniques in the literature which are related to the developments in this th...
متن کاملA spectral-multiplicity-tolerant approach to robust graph matching
The intrinsic information of a graph can be fully encoded into its spectrum and corresponding eigenvectors of its adjacency matrix, which provides a solid foundation for the success of spectral graph matching methods. The spectral multiplicity, however, may significantly affect the matching accuracy. In this paper, we propose a spectral-multiplicity-tolerant graph matching approach. We start fr...
متن کاملGraph Matching using Spectral Embedding and Semidefinite Programming
This paper describes how graph-spectral methods can be used to transform the node correspondence problem into one of point-set alignment. We commence by using the ISOMAP algorithm to embed the nodes of a graph in a low-dimensional Euclidean space. With the nodes in the graph transformed to points in a metric space, we can recast the problem of graph-matching into that of aligning the points. He...
متن کاملSpectral representation for matching and recognition
In this thesis, we aim to use the spectral graph theory to develop a framework to solve the problems of computer vision. The graph spectral methods are concerned with using the eigenvalues and eigenvectors of the adjacency matrix or closely related Laplacian matrix. In this thesis we develop four methods using spectral techniques: (1) We use a Hermitian property matrix for point pattern matchin...
متن کاملEvaluation of Similarity Measures for Template Matching
Image matching is a critical process in various photogrammetry, computer vision and remote sensing applications such as image registration, 3D model reconstruction, change detection, image fusion, pattern recognition, autonomous navigation, and digital elevation model (DEM) generation and orientation. The primary goal of the image matching process is to establish the correspondence between two ...
متن کامل